<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[Topics tagged with rotation cases of avl trees]]></title><description><![CDATA[A list of topics that have been tagged with rotation cases of avl trees]]></description><link>https://community.secnto.com//tags/rotation cases of avl trees</link><generator>RSS for Node</generator><lastBuildDate>Mon, 08 Jun 2026 22:45:09 GMT</lastBuildDate><atom:link href="https://community.secnto.com//tags/rotation cases of avl trees.rss" rel="self" type="application/rss+xml"/><pubDate>Invalid Date</pubDate><ttl>60</ttl><item><title><![CDATA[The objective of this assignment is]]></title><description><![CDATA[@zareen said in The objective of this assignment is:

o	Binary Search trees

Binary Search Tree (BST) –
BST is a special type of binary tree in which left child of a node has value less than the parent and right child has value greater than parent. Consider the left skewed BST shown in Figure 2.
[image: SF9VGHV.png]
Searching: For searching element 1, we have to traverse all elements (in order 3, 2, 1). Therefore, searching in binary search tree has worst case complexity of O(n). In general, time complexity is O(h) where h is height of BST.
Insertion: For inserting element 0, it must be inserted as left child of 1. Therefore, we need to traverse all elements (in order 3, 2, 1) to insert 0 which has worst case complexity of O(n). In general, time complexity is O(h).
Deletion: For deletion of element 1, we have to traverse all elements to find 1 (in order 3, 2, 1). Therefore, deletion in binary tree has worst case complexity of O(n). In general, time complexity is O(h).
]]></description><link>https://community.secnto.com//topic/2156/the-objective-of-this-assignment-is</link><guid isPermaLink="true">https://community.secnto.com//topic/2156/the-objective-of-this-assignment-is</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Invalid Date</pubDate></item></channel></rss>